Inclusion Problems in Trace Monoids
نویسندگان
چکیده
We suggest a number efficient pattern matching algorithms for dependence graphs of traces. A graph G = (V, E, λ) of partial order labeled by letters from alphabet Σ belongs to this class iff there exists a reflexive and symmetric relation D ⊂ Σ × Σ such that if v <G v′ and (λ(v).λ(v′)) ∈ D → (v, v′) ∈ E. We consider pattern matching problems related to problems of recognizing frequent patterns in structured data.
منابع مشابه
A Connection between the Star Problem and the Finite Power Property in Trace Monoids
This paper deals with a connection between two decision problems for recognizable trace languages: the star problem and the nite power property problem. Due to a theorem by Richomme from 1994 26, 28], we know that both problems are decidable in trace monoids which do not contain a C4 submonoid. It is not known, whether the star problem or the nite power property are decidable in the C4 or in tr...
متن کاملSome Undecidability Results Related to the Star Problem in Trace Monoids
This paper deals with decision problems related to the star problem in trace monoids, which means to determine whether the iteration of a recognizable trace language is recognizable. Due to a theorem by Richomme from 1994 30, 31], we know that the Star Problem is decidable in trace monoids which do not contain a C4-submonoid. The C4 is (isomorphic to) the Cartesian Product of two free monoids o...
متن کاملOn Some Decision Problems for Trace Codings
The problem we mainly deal with is the existence of a coding between two trace monoids. We introduce a new notion of coding: the strong coding (independent letters are mapped into independent traces). We prove that the existence of a strong coding between two trace monoids is decidable when the first monoid belongs to one of two large families of trace monoids that we specify. Our decision cond...
متن کاملSolvability of Equations in Free Partially Commutative Groups Is Decidable
Trace monoids are well-studied objects in computer science where they serve as a basic algebraic tool for analyzing concurrent systems. The question whether the existential theory of trace equations is decidable has been solved positively in 1996. Free partially commutative groups (graph groups) generalize trace monoids in the sense that every element has an inverse. In this paper we show that ...
متن کاملSome Undecidability Results Related to the Star Problem in Trace Monoids ? (extended Abstract) ??
This paper deals with decision problems related to the star problem in trace monoids, which means to determine whether the iteration of a recognizable trace language is recognizable. Due to a theorem by Richomme from 1994 18], we know that the star problem is decid-able in trace monoids which do not contain a C4-submonoid. It is not known whether the star problem is decidable in C4. In this pap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009